Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- articleDecember 1997
Order statistics applications to queueing and scheduling problems
Queueing Systems: Theory and Applications (QSYS), Volume 27, Issue 3/4Pages 325–350https://doi.org/10.1023/A:1019126501541We prove several basic combinatorial identities and use them in two applications: the queue inference engine (QIE) and earliest due date rule (EDD) scheduling. Larson (1990) introduced the QIE. His objective was to deduce the behavior of a multiserver ...
- articleAugust 1993
Random Walk and the Area Below its Path
A simple random walk with reflected origin is considered. The walk starts at the origin and it must return to the origin at time 2 n . We show that the expected area below the path of this walk is n 22 n -1/ C n 2 n . If, however, the walk is ...
- articleMay 1988
One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
We consider one-processor scheduling problems having the following form: Tasks T1, T2,..., TN are given, with each Ti having a specified length li and a preferred starting time ai or, equivalently, a preferred completion time bi. The tasks are to be ...